Isogeometric Schwarz Preconditioners with Generalized B-Splines for the Biharmonic Problem
نویسندگان
چکیده
We construct an overlapping additive Schwarz preconditioner for the biharmonic Dirichlet problems discretized by isogeometric analysis based on generalized B-splines (GB-splines) and analyze its optimal convergence rate bound that is cubic in ratio between subdomains overlap sizes. Our validated through a set of numerical experiments illustrate good behavior proposed with respect to model parameters.
منابع مشابه
Isogeometric collocation methods with generalized B-splines
We introduce isogeometric collocation methods based on generalized B-splines and we analyze their performance through numerical examples for univariate and multivariate scalarand vector-valued problems. In particular, advection–diffusion and linear elasticity model problems are addressed. The resultingmethod combines the favorable properties of isogeometric collocation and the geometrical and a...
متن کاملTrivariate Biharmonic B-Splines
In this paper, we formulate a novel trivariate biharmonic B-spline defined over bounded volumetric domain. The properties of bi-Laplacian have been well investigated, but the straightforward generalization from bivariate case to trivariate one gives rise to unsatisfactory discretization, due to the dramatically uneven distribution of neighbouring knots in 3D. To ameliorate, our original idea is...
متن کاملIsogeometric analysis in electromagnetics: B-splines approximation
We introduce a new discretization scheme for Maxwell equations in two space dimension. Inspired by the new paradigm of Isogeometric analysis introduced in [16], we propose an algorithm based on the use of bivariate B-splines spaces suitably adapted to electromagnetics. We construct B-splines spaces of variable interelement regularity on the parametric domain. These spaces (and their push-forwar...
متن کاملSchwarz Preconditioners for Stochastic PDEs
Increasingly the spectral stochastic finite element method (SSFEM) has become a popular computational tool for uncertainty quantification in numerous practical engineering problems. For large-scale problems however, the computational cost associated with solving the arising linear system in the SSFEM still poses a significant challenge. The development of efficient and robust preconditioned ite...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axioms
سال: 2023
ISSN: ['2075-1680']
DOI: https://doi.org/10.3390/axioms12050452